منابع مشابه
Time and Tide Wait for No Diagram
Time plays an important role in some application domains, and can be quite difficult to deal with in diagrams. This is not only true for temporal uncertainty, but also for periodic events. We compare nine different representations that include a notion of time or that are mainly used for temporal information: Time Lines/LifeLines, AsbruView, Ganttand PERT-Charts, Shinkansen timetables, Temporal...
متن کاملSperm Activation: Time and Tide Wait for No Sperm
Studies of the reproductive biology of the nematode Caenorhabditis elegans are providing valuable insights into the evolution and diversity of reproductive strategies [1,2]. The successful production of progeny in any species also highlights many fundamental problems in cell biology. Research on the amoeboid sperm of nematodes addresses a number of issues of broad biological significance, inclu...
متن کاملSolving Re-entrant No-wait Flow Shop Scheduling Problem
In this study, we consider the production environment of no-wait reentrant flow shop with the objective of minimizing makespan of the jobs. In a reentrant flow shop, at least one job should visit at least one of the machines more than once. In a no-wait flowshop scheduling problem, when the process of a specific job begins on the first machine, it should constantly be processed without waiting ...
متن کاملA penalty-shift-insertion-based algorithm to minimize total flow time in no-wait flow shops
This paper proposes a penalty-shift-insertion (PSI)-based algorithm for the no-wait flow shop scheduling problem to minimize total flow time. In the first phase, a penalty-based heuristic, derived from Vogel’s approximation method used for the classic transportation problem is used to generate an initial schedule. In the second phase, a known solution is improved using a forward shift heuristic...
متن کاملAlgorithms for no-wait flowshops with total completion time subject to makespan
The m-machine no-wait flowshop scheduling problem, with the objective of minimizing total completion time subject to the constraint that makespan has to be less than or equal to a certain value, is addressed in this paper. First, an algorithm is proposed to find an upper bound on the makespan in case the upper bound is not given or unknown. Given the upper bound on makespan, a proposed algorith...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: JAMA Internal Medicine
سال: 2015
ISSN: 2168-6106
DOI: 10.1001/jamainternmed.2015.5393